inequality n. 1.不平等,不平均,不平衡,不等量。 2.不相同,互異。 3.變動,變化,高低,起伏。 4.【數(shù)學(xué)】不等式;【天文學(xué)】均差。 5.(平面等的)不平坦。 6.不勝任。 an inequality of temperature 溫度上的變化。 the inequality of the climate 氣候上的變動。 inequality in size 大小不同。 the inequality between the rich and the poor 貧富不均。 one's inequality to a task 不勝任。
constraint n. 1.強(qiáng)迫,拘束。 2.約束,壓抑,拘泥。 3.強(qiáng)制力。 4.緊張感[狀態(tài)]。 by constraint 勉強(qiáng),強(qiáng)迫。 feel constraint覺得局促不安,感受壓迫。 show constraint顯得局促。 under [in] constraint 被迫,不得不;被束縛著。
problem n. 1.問題,課題;疑難問題;令人困惑的情況。 2.【數(shù)、物】習(xí)題;作圖題。 3.(象棋的)布局問題。 the problem of unemployment 失業(yè)問題。 His whole conduct is a problem to me. 他的一切行為我都不理解。 adj. 1.成問題的;難處理的。 2.關(guān)于社會問題的。 a problem child 【心理學(xué)】問題兒童;難管教的孩子。 a problem novel [play] (反映社會問題等的)問題小說[戲劇]。 sleep on [upon, over] a problem 把問題留到第二天解決。
We present and analyze a modified penalty functions ( mpf ) method for solving constrained optimization problems with inequality constraints . this method combines the modified penalty and the lagrangian methods 本文提出并分析一種解決不等式約束最優(yōu)化問題的修改的罰函數(shù)法,這一方法綜合利用修改的罰函數(shù)和拉格朗日法。
The model of dwell function synthesis of planar six - bar mechanism in the dissertation is decomposed into two relatively independent sub - questions . the first one is to evaluate the characteristic of points on moving rigid body , whose mathematics model is a kind of special non - differential max - mini optimal problem with inequality constraints 對于誤差評定,本文利用加權(quán)理論,對要求綜合的平面六桿機(jī)構(gòu)提出了在保證間歇部分精度要求的條件下,使非間歇部分誤差盡可能小的評價思想。
For applying the hybrid optimization algorithm to solve the optimization problem with constraints , a self - adaptive penalty strategy for handling the constraints is designed , which is used to convert the optimization problem with inequality constraints and equality constraints to the one only with the upper and lower bound constraints of the decision variables 為了便于應(yīng)用混合優(yōu)化算法對約束優(yōu)化問題進(jìn)行求解,設(shè)計了一種處理約束條件的自適應(yīng)懲罰策略,用于將具有不等式約束和等式約束的優(yōu)化問題轉(zhuǎn)變?yōu)閮H包含決策變量上、下限約束的優(yōu)化問題。
Chapter 2 establishes the theoretical framework of a class of dual algorithms for solving nonlinear optimization problems with inequality constraints . we prove , under some mild assumptions , the local convergence theorem for this class of dual algorithms and present the error bound for approximate solutions . the modified barrier function methods of polyak ( 1992 ) and the augmented lagrange function method of bertsekas ( 1982 ) are verified to be the special cases of the class of dual algorithms 第2章建立求解不等式約束優(yōu)化問題的一類對偶算法的理論框架,在適當(dāng)?shù)募僭O(shè)條件下,證明了該類算法的局部收斂性質(zhì),并給出近似解的誤差界,驗(yàn)證了polyak ( 1992 )的修正障礙函數(shù)算法以及bertsekas ( 1982 )的增廣lagrange函數(shù)算法都是這類算法的特例。